Independent sequences and freeness criteria
نویسندگان
چکیده
Let M be a module over Noetherian local ring A. We study M-independent sequences of elements the maximal ideal mA in sense Lech and Hanes. The main tool is new characterization M-independence sequence terms associated Koszul complex. As applications, we give result linkage theory, freeness criterion for existence strongly length equal to embedding dimension edim(A) A, another inspired from patching method Calegari Geraghty balanced modules their 2018 paper.
منابع مشابه
On Runs in Independent Sequences
Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.
متن کاملA Further Note on Runs in Independent Sequences
Given a sequence of letters generated independently from a finite alphabet, we consider the case when more than one, but not all, letters are generated with the highest probability. The length of the longest run of any of these letters is shown to be one greater than the length of the longest run in a particular state of an associated Markov chain. Using results of Foulser and Karlin (19...
متن کاملNEW CRITERIA FOR FREENESS IN ABELIAN GROUPS . H ( i )
A new criterion is established for an abelian group to be free. The criterion is in terms of an ascending chain of free subgroups and is dependent upon a new class of torsion-free groups. The result leads to the construction, for each positive integer n, of a group G of cardinality K that is not free but is X -free. A conjecture in infinitary logic concern71 n ing free abelian groups is also ve...
متن کاملCriteria to Disprove Context-Freeness of Collage Languages
Collage grammars generate picture languages in a context-free way. The generating process is based on the replacement of atomic nonterminal items and can be seen as an adaptation of the notion of hyperedge replacement known from the area of context-free graph generation. While a pumping lemma holds for hyperedge replacement graph grammars and is quite useful to show that certain graph languages...
متن کاملAlgorithmically Independent Sequences
Two objects are independent if they do not affect each other. Independence is wellunderstood in classical information theory, but less in algorithmic information theory. Working in the framework of algorithmic information theory, the paper proposes two types of independence for arbitrary infinite binary sequences and studies their properties. Our two proposed notions of independence have some o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2023
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2023.04.001